Computing modular data for pointed fusion categories
نویسندگان
چکیده
منابع مشابه
Abelian Groupoids and Non-pointed Additive Categories
We show that, in any Mal’tsev (and a fortiori protomodular) category E, not only the fibre GrdXE of internal groupoids above the object X is a naturally Mal’tsev category, but moreover it shares with the category Ab of abelian groups the property following which the domain of any split epimorphism is isomorphic with the direct sum of its codomain with its kernel. This allows us to point at a ne...
متن کاملModule Categories over Pointed Hopf Algebras
We develop some techniques for studying exact module categories over some families of pointed finite-dimensional Hopf algebras. As an application we classify exact module categories over the tensor category of representations of the small quantum groups uq(sl2).
متن کامل2 2 A ug 2 01 7 MORITA EQUIVALENCE OF POINTED FUSION CATEGORIES OF SMALL RANK
We classify pointed fusion categories C(G,ω) up to Morita equivalence for 1 < |G| < 32. Among them, the cases |G| = 2, 2 and 3 are emphasized. Although the equivalence classes of such categories are not distinguished by their FrobeniusSchur indicators, their categorical Morita equivalence classes are distinguished by the set of the indicators and ribbon twists of their Drinfeld centers. In part...
متن کاملA good theory of ideals in regular multi-pointed categories
By a multi-pointed category we mean a category C equipped with a so called ideal of null morphisms, i.e. a class N of morphisms satisfying f ∈ N ∨ g ∈ N ⇒ fg ∈ N for any composable pair f, g of morphisms. Such categories are precisely the categories enriched in the category of pairs X = (X,N) where X is a set and N is a subset of X, whereas a pointed category has the same enrichment, but restri...
متن کاملAsymptotic algorithm for computing the sample variance of interval data
The problem of the sample variance computation for epistemic inter-val-valued data is, in general, NP-hard. Therefore, known efficient algorithms for computing variance require strong restrictions on admissible intervals like the no-subset property or heavy limitations on the number of possible intersections between intervals. A new asymptotic algorithm for computing the upper bound of the samp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Indiana University Mathematics Journal
سال: 2021
ISSN: 0022-2518
DOI: 10.1512/iumj.2021.70.8309